Calculation of best fixed polarity Reed-Muller transform over GF(5)
نویسندگان
چکیده
In this article, a new algorithm that takes the truth vector of a 5-valued function as its input and proceeds to generate all of the function’s fixed polarity Reed-Muller (FPRM) spectral coefficient vectors one by one in a certain sequence is presented. The experimental results for this algorithm are compared with other methods and it was found that it is more efficient than other methods for some functions. Moreover, the presented algorithm requires very low memory storage.
منابع مشابه
Generation of multi-polarity helix transform over GF(3)
In this article, the new multi-polarity helix transform for ternary logic functions has been introduced. In addition, an extended dual polarity property that had been used to optimize Kronecker and quaternary Fixed-Polarity Reed-Muller (FPRM) expressions has been applied to generate efficiently the multi-polarity helix transform over GF(3). The experimental results for the transform are compare...
متن کاملNew Ternary Fixed Polarity Linear Kronecker Transforms and Their Comparison with Ternary Reed-muller Transform
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed-Muller t...
متن کاملTernary Fixed Polarity Linear Kronecker Transforms and their Comparison with Ternary Reed-muller Transform
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed–Muller t...
متن کاملFast computing of the positive polarity Reed - Muller transform over GF ( 2 ) and GF ( 3 )
The problem of efficient computing of binary and ternary positive (or zero) polarity Reed-Muller (PPRM) transform is important for many areas. The matrices, determining these transforms, are defined recursively or by Kronecker product. Using this fact, we apply the dynamic-programming strategy to develop three algorithms. The first of them is a new version of a previous our algorithm for perfor...
متن کاملOn the Calculation of Generalized Reed-muller Canonical Expansions from Disjoint Cube Representation of Boolean Functions
A new algorithm is shown that converts disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm Ihal generates the GRME based on the factorization or thc Reed-Muller transform matrix always starts from the truth table (minterms) of Boolean function, then the described method has the advantages due to smaller ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Electronic Express
دوره 1 شماره
صفحات -
تاریخ انتشار 2004